Maximally Atomic Languages
نویسندگان
چکیده
The atoms of a regular language are non-empty intersections of complemented and uncomplemented quotients of the language. Tight upper bounds on the number of atoms of a language and on the quotient complexities of atoms are known. We introduce a new class of regular languages, called the maximally atomic languages, consisting of all languages meeting these bounds. We prove the following result: If L is a regular language of quotient complexity n and G is the subgroup of permutations in the transition semigroup T of the minimal DFA of L, then L is maximally atomic if and only if G is transitive on k-subsets of {1, . . . ,n} for 0 ≤ k ≤ n and T contains a transformation of rank n− 1.
منابع مشابه
A note on prosodic contrasts and segmental analysis in Himalayan languages
In descriptions of most Tibetan(-related) languages two degrees of pitch height (‘register’) both show contrasts in the kinds of plosives that may occur. Since there are two degrees of VOT-differentiated plosives in most of the Central Tibetan languages, voiceless and voiceless aspirated, this yields maximally four possible contrasts for plosive initial syllables. Another tradition posits two d...
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملSufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs
Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree and its in-degree . Now let D be a digraph with minimum degree and edge-connectivity If is real number, then the zeroth-order general Randic index is defined by . A digraph is maximally edge-connected if . In this paper we present sufficient condi...
متن کاملOptimal frequency measurements with maximally correlated states.
We show how maximally correlated states of N two-level particles can be used in spectroscopy to yield a frequency uncertainty equal to (NT), where T is the time of a single measurement. From the time-energy uncertainty relation we show that this is the best precision possible. We rephrase these results in the language of particle interferometry and obtain a state and detection operator which ca...
متن کاملEntangling many atomic ensembles through laser manipulation.
We propose an experimentally feasible scheme to generate the Greenberger-Horne-Zeilinger-type of maximal entanglement between many atomic ensembles based on laser manipulation and single-photon detection. The scheme, with inherent fault tolerance to the dominant noise and efficient scaling of the efficiency with the number of ensembles, allows one to maximally entangle many atomic ensembles wit...
متن کامل